An exact block algorithm for no-idle RPQ problem
نویسندگان
چکیده
منابع مشابه
An Exact Algorithm for the Mode Identity Project Scheduling Problem
In this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (MRCPSP) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. We present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملan exact algorithm for the mode identity project scheduling problem
in this paper we consider the non-preemptive variant of a multi-mode resource constrained project scheduling problem (mrcpsp) with mode identity, in which a set of project activities is partitioned into disjoint subsets while all activities forming one subset have to be processed in the same mode. we present a depth-first branch and bound algorithm for the resource constrained project schedulin...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولAn exact algorithm for Aircraft Landing Problem
This paper addresses the problem of scheduling aircraft landings at an airport. Given a set of planes and runways, the objective is to minimize the total (weighted) deviation from the target landing time for each plane. There are costs associated with landing either earlier or later than a target landing time for each plane. Each plane has to land on one of the runways within its predetermined ...
متن کاملInvasive weed optimization algorithm for optimization no-idle flow shop scheduling problem
In this paper, an invasive weed optimization (IWO) scheduling algorithm is presented for optimization no-idle flow-shop scheduling problem (NFSP) with the criterion to minimize the maximum completion time (makespan). Firstly, a simple approach is put forward to calculate the makespan of job sequence. Secondly, the most position value (MPV) method is used to code the weed individuals so that fit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Archives of Control Sciences
سال: 2017
ISSN: 2300-2611
DOI: 10.1515/acsc-2017-0021